#include<bits/stdc++.h>
using namespace std;
priority_queue<int> q0;
int n, a, ans;
vector<bool> hp, atk;
vector<int> pq;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d", &n);
    ans=n;
    for(int i=1;i<=n;i++){
        scanf("%d", &a);
        q0.push(a);
        hp.push_back(1);
        atk.push_back(0);
    }
    for(int i=1;i<=n;i++){
        pq.push_back(q0.top());
        q0.pop();
    }
    for(int i=n-1;i>=0;i--){
        if(hp[i]){
                //cout<<"now:"<<i<<endl;
            for(int j=i-1;j>=0;j--){
                if((pq[j]!=pq[i]) && !atk[j]){
                //    cout<<"use:"<<j<<endl;
                    hp[i]=0;
                    atk[j]=1;
                    ans--;
                    /*for(int k=1;k<=n;k++){
                        cout<<hp[k];
                    }
                    cout<<endl;
                    for(int k=1;k<=n;k++){
                        cout<<atk[k];
                    }
                    cout<<endl<<endl;*/
                    break;
                }
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}
